Covering the recursive sets
نویسندگان
چکیده
منابع مشابه
Covering the Recursive Sets
We give solutions to two of the questions in a paper by Brendle, BrookeTaylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct constructions using martingales. At the same time, we introduce the concept of i.o. subuniformity and relate this concept to recursive measure theory. We prove that there are classes closed downwards under Turing reduci...
متن کاملCovering Numbers in Covering-Based Rough Sets
Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...
متن کاملImproving Two Recursive Constructions for Covering Arrays
Recursive constructions for covering arrays employ small ingredient covering arrays to build large ones. At present the most effective methods are “cut–and–paste” (or Roux-type) and column replacement techniques. Both can introduce substantial duplication of coverage; if unnecessary duplication can be avoided then the recursion can yield a smaller array. Two extensions of covering arrays are in...
متن کاملMinimal Logical Constraint Covering Sets
We propose a general framework for computing minimal set covers under class of certain logical constraints. The underlying idea is to transform the problem into a mathematical programm under linear constraints. In this sense it can be seen as a natural extension of the vector quantization algorithm proposed by [5]. We show which class of logical constraints can be cast and relaxed into linear c...
متن کاملDistances Realized by Sets Covering the Plane
A proof is given of the (known) result that, if real n-dimensional Euclidean space R” is covered by any n + 1 sets, then at least one of these sets is such that each distance d (0 < d < a)) is realized as the distance between two points of the set. In particular, this result holds if the plane is covered by three sets; but it does not necessarily hold if the plane is covered by six sets. I f ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2017
ISSN: 0168-0072
DOI: 10.1016/j.apal.2016.10.017